Independence in Database Relations
نویسندگان
چکیده
We investigate the implication problem for independence atoms X⊥Y of disjoint attribute sets X and Y on database schemata. A relation satisfies X⊥Y if for every X-value and every Y -value that occurs in the relation there is some tuple in the relation in which the X-value occurs together with the Y -value. We establish an axiomatization by a finite set of Horn rules, and derive an algorithm for deciding the implication problem in low-degree polynomial time in the input. We show how to construct Armstrong relations which satisfy an arbitrarily given set of independence atoms and violate every independence atom not implied by the given set. Our results establish independence atoms as an efficient subclass of embedded multivalued data dependencies which are not axiomatizable by a finite set of Horn rules, and whose implication problem is undecidable.
منابع مشابه
The Recognition and Ranking of the Dimensions of University Autonomy with Reason and Cause Approaches for the Efficiency of Islamic Azad Universities
The general purpose of this study was to identify and rank the dimensions of academic independence with causal and causal approaches in Islamic Azad universities of Mazandaran province. This research was applied in terms of purpose and descriptive in terms of method. The statistical population consisted of all faculty members of Islamic Azad universities of Mazandaran province in the number of ...
متن کاملConstructibility and decidability versus domain independence and absoluteness
We develop a unified framework for dealing with constructibility and absoluteness in set theory, decidability of relations in effective structures (like the natural numbers), and domain independence of queries in database theory. Our framework and results suggest that domain-independence and absoluteness might be the key notions in a general theory of constructibility, predicativity, and comput...
متن کاملConditional Independence Relations Have No Finite Complete Characterization
The hypothesis of existence of a nite characterization of conditional{independence relations (CIRs) is refused. This result is shown to be equivalent with the non{existence of a simple deductive system describing relationships among CI{statements (it is certain type of syntactic description). However, under the assumption that CIRs are grasped the existence of a countable characterization of CI...
متن کاملA Comparative Study of Noncontextual and Contextual Dependencies
There is current interest in generalizing Bayesian networks by using dependencies which are more general than probabilistic conditional independence (CI). Contextual dependencies, such as contextspecific independence (CSI), are used to decompose a subset of the joint distribution. We have introduced a more general contextual dependency than CSI, as well as a more general noncontextual dependenc...
متن کاملPIQUE: a relational query language without relations
Relational database systems have gone far towards providing users with physical data independence. T o use a relational database, users need not know the physical storage structures of relations, and are protected from changes in these structures. However, a user must still navigate among relations. In other words! if the information needed to answer a question spans several relations, he must ...
متن کامل